全文获取类型
收费全文 | 24277篇 |
免费 | 3005篇 |
国内免费 | 2462篇 |
专业分类
电工技术 | 2179篇 |
综合类 | 2222篇 |
化学工业 | 667篇 |
金属工艺 | 315篇 |
机械仪表 | 1216篇 |
建筑科学 | 459篇 |
矿业工程 | 296篇 |
能源动力 | 405篇 |
轻工业 | 372篇 |
水利工程 | 218篇 |
石油天然气 | 262篇 |
武器工业 | 242篇 |
无线电 | 3121篇 |
一般工业技术 | 1951篇 |
冶金工业 | 584篇 |
原子能技术 | 694篇 |
自动化技术 | 14541篇 |
出版年
2024年 | 168篇 |
2023年 | 357篇 |
2022年 | 542篇 |
2021年 | 621篇 |
2020年 | 742篇 |
2019年 | 681篇 |
2018年 | 627篇 |
2017年 | 908篇 |
2016年 | 980篇 |
2015年 | 1121篇 |
2014年 | 1500篇 |
2013年 | 2005篇 |
2012年 | 1753篇 |
2011年 | 1863篇 |
2010年 | 1360篇 |
2009年 | 1627篇 |
2008年 | 1758篇 |
2007年 | 1787篇 |
2006年 | 1560篇 |
2005年 | 1229篇 |
2004年 | 1074篇 |
2003年 | 928篇 |
2002年 | 765篇 |
2001年 | 639篇 |
2000年 | 548篇 |
1999年 | 387篇 |
1998年 | 347篇 |
1997年 | 324篇 |
1996年 | 224篇 |
1995年 | 188篇 |
1994年 | 174篇 |
1993年 | 138篇 |
1992年 | 118篇 |
1991年 | 81篇 |
1990年 | 62篇 |
1989年 | 72篇 |
1988年 | 64篇 |
1987年 | 37篇 |
1986年 | 36篇 |
1985年 | 47篇 |
1984年 | 60篇 |
1983年 | 45篇 |
1982年 | 35篇 |
1981年 | 33篇 |
1980年 | 32篇 |
1979年 | 17篇 |
1978年 | 13篇 |
1977年 | 12篇 |
1976年 | 13篇 |
1959年 | 16篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
带关键字搜索的公钥加密(PEKS)是一种有用的加密原语,它允许用户将在加密数据上搜索的功能委托给不可信的第三方服务器,而不影响原始数据的安全性和隐私性。但是,由于缺乏对于数据的加密以及解密能力,PEKS方案不能单独进行使用,必须与标准的公钥加密方案(PKE)相结合。因此,Baek等人在2006年引入了一种新的加密原语,称为结合PKE和PEKS的加密方案(PKE+PEKS),它同时提供了PKE和PEKS的功能。目前,已有文献提出了几种PKE+PEKS方案。然而,他们都没有考虑关键字猜测攻击的问题。本文提出一个新的高效且能够抵抗关键字猜测攻击的PKE+PEKS方案,与已有方案相比,该方案在性能上有很大的提升,并且在生成关键字和数据密文时,不需要使用双线性对,极大地降低了计算和存储成本。安全性分析表明,本文中所提出的方案能够满足密文隐私安全性、陷门不可区分性和抗关键字猜测攻击的安全性。效率分析表明,本分提出的方案更加高效。 相似文献
2.
Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a
given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred
to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional
(resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional
(resp., unidirectional) topology is k-edge connected.
The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied
by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18],
which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19],
which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity.
In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity,
and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity
and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for
distributed implementation.
A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless
(Adhoc-Now 2003).
Research performed in part while visiting the Max-Plank-Institut fur Informatik.
Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting
researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University
of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms.
Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor
since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and
Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990.
His research interests include optical networks and wireless networks. 相似文献
3.
基于遗传算法的服装工序编排规划 总被引:2,自引:0,他引:2
本文讨论了建立服装工序编排系统的必要性,在进行服装工序拆分、合并的基础上,应用遗传算法建立了以流水线平衡为目标的服装工序编排模型. 相似文献
4.
5.
陈国龙 《计算机辅助设计与图形学学报》1994,6(2):136-142
本文介绍了一种在微机上实现的印制板自动布线方法──多级线探索法及其编程方法。这种方法是基于完备布线算法的概念,通过分析李氏算法和传统线探索法的不足之处而得到的。虽然它也是一种线探索法,但有较传统线探索法更强的探索能力,不需要结合李氏算法而能单独完成布线任务,是一种较理想的算法,通过实验获得了较为满意的效果。 相似文献
6.
心电地图仪中工频干扰的一种滤除方法 总被引:1,自引:0,他引:1
在心电地图仪中记录到的体表心电信号往往由于电磁的影响而引进工频干扰.基于体表心电信号中工频干扰的特点,作者提出了一种滤除工频干扰的方法,即就单独—胸导联信号通过提高频谱的分辨率来估计工频干扰的频率;基于最小均方误差准则来估计各导联信号中工频干扰的幅度和相位。文中还给出了该算法的流程图和滤波性能分析。模拟结果表明了该算法的有效性。应用该算法对心电地图仪中的工频干扰进行对消,取得了满意的结果。 相似文献
7.
I. Belda X. Llorà E. Giralt 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2006,10(4):295-304
One of the goals of computational chemistry is the automated de novo design of bioactive molecules. Despite significant progress
in computational approaches to ligand design and efficient evaluation of binding energy, novel procedures for ligand design
are required. Evolutionary computation provides a new approach to this design issue. This paper presents an automated methodology
for computer-aided peptide design based on evolutionary algorithms. It provides an automatic tool for peptide de novo design,
based on protein surface patches defined by user. Regarding the restrictive constrains of this problem a special emphasis has been made on the design of the
evolutionary algorithms implemented. 相似文献
8.
Masami Ikeda Susumu Fukumoto Hiroshi Takao Shinya Ohtsuka Eiichi Haginomori Masayuki Hikita 《Electrical Engineering in Japan》2002,141(4):16-24
This paper describes the dielectric breakdown characteristics of oil and oil‐impregnated paper for very fast transient (VFT) voltages. Blumlein circuits generate VFT voltages of 60 and 300 ns in a pulse width that simulates disconnecting switching surges in gas‐insulated switch gears. We measured the breakdown voltages of needle‐to‐plane, plane‐to‐plane oil gaps and several pieces of paper between plane electrodes for VFT and lightning impulse voltages. The measured data were formulated in V‐t characteristics and Weibull probability distributions. The inclination n of V‐t characteristics of insulating paper is 150, which is less than n = 13.7 of the plane‐to‐plane oil gap in the VFT time range. The shape parameters of Weibull distribution obtained in this study show that the scattering of breakdown voltages of paper is much less than that of oil. © 2002 Wiley Periodicals, Inc. Electr Eng Jpn, 141(4): 16–24, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/eej.10043 相似文献
9.
Timothy Thomasma Kurt Hilbrecht 《International Journal of Flexible Manufacturing Systems》1991,3(3-4):231-250
Good methods are needed to specify, test, and debug material-handling control logic. This article surveys a number of representative methods for defining and describing control algorithms for programmable material-handling equipment used in flexible manufacturing systems. The methods are evaluated with regard to their suitability for communication between people and as bases for interfaces to automatic program generators. It is concluded that no single method is entirely satisfactory. Three methods (position diagrams, function block diagrams, and operation networks) have potential to be combined into an effective hybrid approach that minimizes the need for the user to switch between various conceptual models. 相似文献
10.
An efficient algorithm for the random packing of spheres can significantly save the cost of the preparation of an initial configuration often required in discrete element simulations. It is not trivial to generate such random packing at a large scale, particularly when spheres of various sizes and geometric domains of different shapes are present. Motivated by the idea of compression complemented by an efficient physical process to increase packing density, shaking, a new approach, termed compression algorithm, is proposed in this work to randomly fill any arbitrary polyhedral or cylindrical domains with spheres of various sizes. The algorithm features both simplicity and high efficiency. Tests show that it takes 181 s on a 1.4-GHz PC to complete the filling of a cylindrical domain with a total number of 26,787 spheres, achieving a packing density of 52.89%. 相似文献